#include <algorithm>
#include <iostream>
using namespace std;
namespace justin_jiajia_solution {
const int mx = 1e5 + 3;
int ability[mx];
bool used[mx];
int n;
void solve() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> ability[i];
  sort(ability, ability + n);
  int killed = 0;
  bool flag;
  do {
    flag = false;
    for (int i = killed; i < n; ++i) {
      if (ability[killed] < ability[i] && !used[i]) {
        used[i] = true;
        ++killed;
        flag = true;
        // cout << killed - 1 << "killed\n";
      }
    }
  } while (flag);
  cout << n - killed << endl;
}
};  // namespace justin_jiajia_solution
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  freopen("duel.in","r",stdin);
  freopen("duel.out","w",stdout);
  justin_jiajia_solution::solve();
  cout.flush();
}
// main started at 14:30
// main finished at 14:55
// excepted:100pts